package euler.p001_050;

import euler.MainEuler;

public class Euler010 extends MainEuler {

    /*
        The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

        Find the sum of all the primes below two million.
     */
    public String resolve(int limite) {
        long suma = 0;
        for (int i = 2; i < limite; i++) {
            if (primeHelper.isPrime(i)) {
                suma+=i;
            }
        }

        return String.valueOf(suma);
    }

}
